package com.yun.algorithmproblem.leetcode;

import java.util.List;
import java.util.Set;

public class Leetcode3287 {

    public static void main(String[] args) {
/*        Leetcode3287 obj=new Leetcode3287();
        int[] nums=new int[]{4,2,5,6,7};
        int k=2;
        obj.maxValue(nums,k);*/
    }

    /*
    1.统计每一位出现0和1的次数
    2.总长度为n,如果前半段为[0,k-1],后半段为[k,n-1], n-1-k+1=n-k>= k,n>=2k
    3.设循环变量为i,前半段为[0,k-1+i],后半段为[k+i,n-1], n-1-k-i+1=n-k-i>=k,n>=2k+i
    4.要使得最后的值最大,a.前半段or为1,后半段or为0,b.前半段or为0,后半段or为1.
    5.查询前后半段出现0的数量(数组)
     */
    public int maxValue(int[] nums, int k) {
        int n = nums.length;
        int[][] bits = new int[n][8];
        for (int i = 0; i < n; i++) {

        }
        return 0;
    }

    private List<Set<Integer>> findORs(int[] nums,int k){
        return null;
    }
}
